منابع مشابه
Tournament immersion and cutwidth
A (loopless) digraph H is strongly immersed in a digraph G if the vertices of H are mapped to distinct vertices of G, and the edges of H are mapped to directed paths joining the corresponding pairs of vertices of G, in such a way that the paths used are pairwise edge-disjoint, and do not pass through vertices of G that are images of vertices of H. A digraph has cutwidth at most k if its vertice...
متن کاملCutwidth of triangular grids
When the vertices of an n-vertex graph G are numbered by the integers 1 through n, the length of an edge is the difference between the numbers on its endpoints. Two edges overlap if the larger of their lower numbers is less than the smaller of their upper numbers. The bandwidth of G is the minimum, over all numberings, of the maximum length of an edge. The cutwidth of G is the minimum, over all...
متن کاملCutwidth and degeneracy of graphs
We prove an inequality involving the degeneracy, the cutwidth and the sparsity of graphs. It implies a quadratic lower bound on the cutwidth in terms of the degeneracy for all graphs and an improvement of it for clique-free graphs.
متن کاملCyclic Cutwidth of the Mesh
The cutwidth problem is to nd a linear layout of a network so that the maximal number of cuts (cw) of a line separating consecutive vertices is minimized. A related and more natural problem is the cyclic cutwidth (ccw) when a circular layout is considered. The main question is to compare both measures cw and ccw for speciic networks, whether adding an edge to a path and forming a cycle reduces ...
متن کاملOn Bandwidth, Cutwidth, and Quotient Graphs
The bandwidth and the cutwidth are fundamental parameters which can give indications on the complexity of many problems described in terms of graphs. In this paper, we present a method for nding general upper bounds for the bandwidth and the cutwidth of a given graph from those of any of its quotient graphs. Moreover, general lower bounds are obtained by using vertex-and edge-bisection notions....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2012
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2011.05.001